A bi-stage surrogate-assisted hybrid algorithm for expensive optimization problems
نویسندگان
چکیده
Abstract Surrogate-assisted meta-heuristic algorithms have shown good performance to solve the computationally expensive problems within a limited computational resource. Compared method that only one surrogate model is utilized, ensembles more efficiency get optimal solution. In this paper, we propose bi-stage surrogate-assisted hybrid algorithm optimization problems. The framework of proposed composed two stages. first stage, number global searches will be conducted in sequence explore different sub-spaces decision space, and solution with maximum uncertainty final generation each search evaluated using exact improve accuracy approximation on corresponding sub-space. second local added exploit sub-space, where best position found so far locates, find better for real evaluation. Furthermore, stage take turns balance trade-off exploration exploitation. Two are, respectively, utilized search. To evaluate our method, conduct experiments seven benchmark problems, Lennard–Jones potential problem constrained test problem, compare five state-of-the-art methods solving experimental results show can obtain results, especially high-dimensional
منابع مشابه
A multi-fidelity surrogate-model-assisted evolutionary algorithm for computationally expensive optimization problems
Integrating data-driven surrogate models and simulation models of di erent accuracies (or delities) in a single algorithm to address computationally expensive global optimization problems has recently attracted considerable attention. However, handling discrepancies between simulation models with multiple delities in global optimization is a major challenge. To address it, the two major contrib...
متن کاملEvolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling
We present a parallel evolutionary optimization algorithm that leverages surrogate models for solving computationally expensive design problems with general constraints, on a limited computational budget. The essential backbone of our framework is an evolutionary algorithm coupled with a feasible sequential quadratic programming solver in the spirit of Lamarckian learning.We employ a trust-regi...
متن کاملA hybrid one-then-two stage algorithm for computationally expensive electromagnetic design optimization
Purpose – The purpose of this paper is to propose a surrogate model-assisted optimization algorithm which effectively searches for the optimum at the earliest opportunity, avoiding the need for a large initial experimental design, which may be wasteful. Design/methodology/approach – The methodologies of two-stage and one-stage selection of points are combined for the first time. After creating ...
متن کاملA computational intelligence algorithm for expensive engineering optimization problems
The modern engineering design optimization process often replaces laboratory experiments with computer simulations, which leads to expensive black-box optimization problems. Such problems often contain candidate solutions which cause the simulation to fail, and therefore they will have no objective value assigned to them, a scenario which degrades the search effectiveness. To address this, this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2021
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-021-00277-1